IDEAL PROJECTIONS AND FORCING PROJECTIONS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ideal Projections and forcing Projections

It is well known that saturation of ideals is closely related to the “antichain-catching” phenomenon from Foreman-Magidor-Shelah [10]. We consider several antichain-catching properties that are weaker than saturation, and prove: (1) If I is a normal ideal on ω2 which satisfies stationary antichain catching, then there is an inner model with a Woodin cardinal; (2) For any n ∈ ω, it is consistent...

متن کامل

Ideal Projections onto Planes

In this paper we classify all ideal projections from C[x, y] onto the linear span of 1, x, y. In particular we show that every such projection is a limit of interpolating projections. That verifies one particular case of a conjecture of C. deBoor. §

متن کامل

A note on lifting projections

Suppose $pi:mathcal{A}rightarrow mathcal{B}$ is a surjective unital $ast$-homomorphism between C*-algebras $mathcal{A}$ and $mathcal{B}$, and $0leq aleq1$ with $ain  mathcal{A}$. We give a sufficient condition that ensures there is a proection $pin mathcal{A}$ such that $pi left( pright) =pi left( aright) $. An easy consequence is a result of [L. G. Brown and G. k. Pedersen, C*-algebras of real...

متن کامل

Reconstruction From Ideal Projections Using a Computer Algebra System

Computer algebra systems can be used to perform analyses requiring extensive algebraic manipulation and provide a means of performing precise mathematical explorations that are impractical if done by hand. The ability to graphically display results makes these systems useful also as educational aids and for demonstrating non-intuitive mathematical relationships in particular. In this paper, we ...

متن کامل

RANDOM PROJECTIONS Margin-constrained Random Projections And Very Sparse Random Projections

Abstract We1 propose methods for improving both the accuracy and efficiency of random projections, the popular dimension reduction technique in machine learning and data mining, particularly useful for estimating pairwise distances. Let A ∈ Rn×D be our n points in D dimensions. This method multiplies A by a random matrix R ∈ RD×k, reducing the D dimensions down to just k . R typically consists ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Symbolic Logic

سال: 2014

ISSN: 0022-4812,1943-5886

DOI: 10.1017/jsl.2013.24